Instruction-Level Parallel Processors— Dynamic and Static Scheduling Tradeoffs
نویسندگان
چکیده
Recently, high-performance computer architecture has focused on dynamic scheduling techniques to issue and execute multiple operations concurrently. These designs are complex and have frequently shown disappointing performance. A complementary approach is the use of static scheduling techniques to exploit the same parallelism. In this paper we describe some of the tradeoffs between the use of static and dynamic scheduling techniques and show that with appropriate scheduling, low-complexity designs using only static scheduling have significant advantages over high-complexity designs using dynamic scheduling in real systems.
منابع مشابه
Architecture and Compiler Design Issues in Programmable Media Processors
The processing demands for multimedia applications are rapidly escalating. Many current applications are pushing the limits of existing microprocessors, and the next generation of multimedia promises considerably greater demands. Adequate support for future multimedia requires the flexibility and computing power of high-level language (HLL) programmable media processors. This thesis examines th...
متن کاملMinimum Register Instruction Scheduling: A New Approach for Dynamic Instruction Issue Processors
Modern superscalar architectures with dynamic scheduling and register renaming capabilities have introduced subtle but important changes into the tradeoffs between compile-time register allocation and instruction scheduling. In particular, it is perhaps not wise to increase the degree of parallelism of the static instruction schedule at the expense of excessive register pressure which may resul...
متن کاملDynamic Memory Disambiguation Using the Memory Connict Buuer
To exploit instruction level parallelism, compilers for VLIW and superscalar processors often employ static code scheduling. However, the available code reordering may be severely restricted due to ambiguous dependences between memory instructions. This paper introduces a simple hardware mechanism, referred to as the memory connict buuer, which facilitates static code scheduling in the presence...
متن کاملExplicit Dynamic Scheduling: A Practical Micro-Data ow Architecture
This paper introduces Explicit Dynamic Scheduling (EDS), a practical implementation of dataaow on a chip. By combining RISC design principles with well-known compiler dependence analysis techniques, EDS combines a straightforward hardware design, suitable for high speed implementation, with the performance advantages of dataaow at the instruction level. EDS uniies pipeline and memory latency to...
متن کاملDynamic Scheduling Techniques for VLIW Processors
instruction-level parallelism, VLIW processors, superscalar processors, pipelining, multiple operation issue, scoreboarding, dynamic scheduling, out-of -order execution VLIW processors are viewed as an attractive way of achieving instruction-level parallelism because of their ability to issue multiple operations per cycle with relatively simple control logic. They are also perceived as being of...
متن کامل